Graph Formations of Partial-Order Multiple-Sequence Alignments Using Nano and Micro-Scale Reconfigurable Meshes

نویسندگان

  • Mary Mehrnoosh Eshaghian-Wilner
  • Ling Lau
  • Shiva Navab
  • David Shen
چکیده

In this paper, we show how to form Partial-Order Multiple-Sequence Alignment graphs on two types of reconfigurable mesh architectures. The first reconfigurable mesh is a standard micro-scale one that uses electrical interconnects, while the second one can be implemented at a nano-scale level and employs spin waves for interconnectivity. We consider graph formations for two cases. In one case, the number of distinct variables in the data sequences is constant. In the other case, it can be as much as O(N). We show that given O(N) aligned sequences of length L, we can combine the sequences to form a graph in O(1) time, using either architecture if there is a constant number of distinct variables in the sequence. Otherwise, it will take O(log N) time if we use the spin-wave model and O(N) time if we use the standard non-spin-wave-based version.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical Multi-Scale Architectures with Spin Waves1

In this paper, we present three hierarchical multiscale architectures that are interconnected electrooptically at micro-scale level and via spin waves at nanoscale level. These architectures are derived from the Optical Reconfigurable Mesh (ORM), which is a MEMS architecture that supports several types of electrical and optical routings. The first multi-scale architecture presented here is a st...

متن کامل

Pairwise Partial Order Alignment as a Supergraph Problem — Aligning Alignments Revisited

Partial Order Alignment (POA) has been proposed recently as an alternative to conventional sequence alignment. Instead of the familiar tabular alignments, POA methods produce a partial order — a labeled directed acyclic graph — that includes the input sequences. In this paper, we formalize POA in terms of graphs, and show it corresponds to finding a Minimal Common Supergraph for a set of partia...

متن کامل

Multiple Partial Order Alignment as a Graph Problem

Multiple Sequence Alignment (MSA) is a fundamental tool of bioinformatics. Row-Column MSA (RC-MSA) methods such as CLUSTALW [12] produce tabular alignments that are now familiar. However, these methods have a number of shortcomings, including difficulty of understanding the result, high computational complexity, questionable assumptions, and other artifacts (such as poor handling of prefixand s...

متن کامل

Combining partial order alignment and progressive multiple sequence alignment increases alignment speed and scalability to very large alignment problems

MOTIVATION Partial order alignment (POA) has been proposed as a new approach to multiple sequence alignment (MSA), which can be combined with existing methods such as progressive alignment. This is important for addressing problems both in the original version of POA (such as order sensitivity) and in standard progressive alignment programs (such as information loss in complex alignments, espec...

متن کامل

Multiple sequence alignment using partial order graphs

MOTIVATION Progressive Multiple Sequence Alignment (MSA) methods depend on reducing an MSA to a linear profile for each alignment step. However, this leads to loss of information needed for accurate alignment, and gap scoring artifacts. RESULTS We present a graph representation of an MSA that can itself be aligned directly by pairwise dynamic programming, eliminating the need to reduce the MS...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006